منابع مشابه
Path-Following Methods for Linear Programming
JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected]. Abstract. In this paper a unified treatment of algorithms ...
متن کاملEulerian Path Methods for Multiple Sequence Alignment
With the rapid increase in the size of genome sequence databases, the multiple sequence alignment problem is increasingly important and often requires the alignment of a large number of sequences. Beginning in 1975, many heuristic algorithms have been created to improve the speed of computation and the quality of alignment. We introduce a novel approach that is fundamentally distinct from all c...
متن کاملWeighted Optimal Path in Graph with Multiple Indexes
This paper represents a technique for finding optimal paths with multiple indexes in a graph. Up to the present time, all optimal paths have been determined upon one index, say, distance for which an evaluation method exists. In this paper firstly we define multiple indexes for each edge in such a way that anyone can treat the factor for assigning an optimal path. Here, we use Data Envelopment ...
متن کاملComplexity of Path-Following Methods for the Eigenvalue Problem
A unitarily invariant projective framework is introduced to analyze the complexity of path–following methods for the eigenvalue problem. A condition number, and its relation to the distance to ill–posedness, is given. A Newton map appropriate for this context is defined, and a version of Smale’s γ-Theorem is proven. The main result of this paper bounds the complexity of path–following methods i...
متن کاملAn Adaptation of Krylov Subspace Methods to Path Following Problems
A procedure is outlined for adapting Krylov subspace methods to solving approximately the underdetermined linear systems that arise in path following (continuation, homotopy) methods. This procedure, in addition to preserving the usual desirable features of Krylov subspace methods, has the advantages of satisfying orthogonality constraints exactly and of not introducing ill-conditioning through...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2000
ISSN: 0022-247X
DOI: 10.1006/jmaa.2000.7034